Approximate differentiation: Jarník points

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate differentiation: Jarńık points

We investigate Jarńık’s points for a real function f defined in R, i.e. points x for which lim apy→x |(f(y)− f(x))/(y − x)| = +∞. In 1970, Berman has proved that the set Jf of all Jarńık’s points for a path f of the one-dimensional Brownian motion is the whole R almost surely. We give a simple explicit construction of a continuous function f with Jf = R. The main result of our paper says that f...

متن کامل

Approximate Saddle Points Portfolios

We introduce the concept of saddle points portfolio and we establish a connection between this concept and the approximate minima.

متن کامل

Digital Fixed Points, Approximate Fixed Points, and Universal Functions

A. Rosenfeld [23] introduced the notion of a digitally continuous function between digital images, and showed that although digital images need not have fixed point properties analogous to those of the Euclidean spaces modeled by the images, there often are approximate fixed point properties of such images. In the current paper, we obtain additional results concerning fixed points and approxima...

متن کامل

Approximate Fekete Points for Weighted Polynomial Interpolation

We compute approximate Fekete points for weighted polynomial interpolation by a recent algorithm based on QR factorizations of Vandermonde matrices. We consider in particular the case of univariate and bivariate functions with prescribed poles or other singularities, which are absorbed in the basis by a weight function. Moreover, we apply the method to the construction of real and complex weigh...

متن کامل

Fast SVM training using approximate extreme points

Applications of non-linear kernel Support Vector Machines (SVMs) to large datasets is seriously hampered by its excessive training time. We propose a modification, called the approximate extreme points support vector machine (AESVM), that is aimed at overcoming this burden. Our approach relies on conducting the SVM optimization over a carefully selected subset, called the representative set, of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fundamenta Mathematicae

سال: 1991

ISSN: 0016-2736,1730-6329

DOI: 10.4064/fm-140-1-87-97